Ashwini Index of a Graph
نویسنده
چکیده
+ degT (N(vj))], where dT (vi, vj) is the distance between the vertices vi, vj ∈ V (T ), is equal to the length of the shortest path starting at vi and ending at vj and degT (N(v)) is the cardinality of degT (u), where uv ∈ E(T ). In this paper, trees with minimum and maximum A are characterized and the expressions for the Ashwini index are obtained for detour saturated trees T3(n), T4(n) as well as a class of Dendrimers Dh.
منابع مشابه
Ashwini Index of a Graph
Motivated by the terminal Wiener index, we define the Ashwini index $mathcal{A}$ of trees as begin{eqnarray*} % nonumber to remove numbering (before each equation) mathcal{A}(T) &=& sumlimits_{1leq i
متن کاملOn computing the general Narumi-Katayama index of some graphs
The Narumi-Katayama index was the first topological index defined by the product of some graph theoretical quantities. Let $G$ be a simple graph with vertex set $V = {v_1,ldots, v_n }$ and $d(v)$ be the degree of vertex $v$ in the graph $G$. The Narumi-Katayama index is defined as $NK(G) = prod_{vin V}d(v)$. In this paper, the Narumi-Katayama index is generalized using a $n$-ve...
متن کاملPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
متن کاملBounds on First Reformulated Zagreb Index of Graph
The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.
متن کاملA note on hyper-Zagreb index of graph operations
In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].
متن کامل